On Finding Ordinary Intersection Points∗
نویسندگان
چکیده
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n logn). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n logn). Two additional algorithms are provided that find an ordinary or monochromatic intersection, respectively, in an arrangement of pseudolines in time O(n).
منابع مشابه
On Finding Ordinary or Monochromatic Intersection Points
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n log n). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n log n). Two additio...
متن کاملA new approach for assessing stability of rock slopes considering centroids of weak zones
The intersection lines between discontinuity surfaces and their intersection points on the visible surfaces of any engineering structure may be the instability indicators. This paper describes a new approach to modelling the intersecting lines and points that would provide the first evaluation of any instability in an engineering structure characterized by the failure modes. In this work, the i...
متن کاملHilbert scheme intersection numbers , Hurwitz numbers , and Gromov - Witten invariants
Some connections of the ordinary intersection numbers of the Hilbert scheme of points on surfaces to the Hurwitz numbers for P1 as well as to the relative Gromov-Witten invariants of P1 are established.
متن کاملSurface slicing algorithm based on topology transition
Presented in this paper is an algorithm to compute the intersections of a parametric regular surface with a set of parallel planes. Rather than using an ordinary surface-plane intersection algorithm repeatedly, we pre-process a surface to identify points, called topology transition points (TTP's), on the surface where the topologies of intersection curves change. It turns out that such points c...
متن کاملA Robust Intersection Algorithm Based on Delaunay Triangulation
The paper presents a new robust method for finding points of intersection of line segments in the plane. In this method the subdivision of the plane based on the Delaunay triangulation plays the main role. First, the Delaunay triangulation spanning the end points of line segments is constructed. Next, for line segments that are not realized by Delaunay edges, midpoints are inserted recursively ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009